Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines
نویسندگان
چکیده
منابع مشابه
Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates
The considered problem is the scheduling of a set of N jobs on M identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant ...
متن کاملScheduling interval orders with release dates and deadlines
We study the problem of scheduling unit-length tasks with release dates and deadlines subject to precedence constraints and unit communication delays. Two polynomial-time algorithms are de ned: one constructs schedules for graphs with uniform release dates, the other for graphs with arbitrary release dates. They have a special structure: unlike most scheduling algorithms, they do not consider i...
متن کاملSingle-machine scheduling with release dates, due dates and family setup times
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...
متن کاملScheduling UET, UCT dags with release dates and deadlines
The problem of scheduling precedence graphs for which every task has to be executed in a non-uniform interval is considered, with interprocessor communication delays. For the following classes of graphs we will present a polynomial time algorithm that nds minimumlateness schedules. 1. Outforests on two processors. 2. Series-parallel graphs and opposing forests with the least urgent parent prope...
متن کاملSingle Machine Scheduling with Release Dates
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation. We show their equivalence by proving that a O(n logn) greedy algorithm leads to optimal solutions to both relax...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Economics
سال: 2014
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2014.04.013